Preserving Filtering Unification by Adding Compatible Operations to Some Heyting Algebras
نویسندگان
چکیده
منابع مشابه
Preserving Filtering Unification by Adding Compatible Operations to Some Heyting Algebras
We show that adding compatible operations to Heyting algebras and to commutative residuated lattices, both satisfying the Stone law ¬x∨¬¬x = 1, preserves filtering (or directed) unification, that is, the property that for every two unifiers there is a unifier more general then both of them. Contrary to that, often adding new operations to algebras results in changing the unification type. To pr...
متن کاملCompatible operations in some subvarieties of the variety of weak Heyting algebras
Weak Heyting algebras are a natural generalization of Heyting algebras (see [2], [5]). In this work we study certain subvarieties of the variety of weak Heyting algebras in order to extend some known results about compatible functions in Heyting algebras.
متن کاملOn Heyting algebras and dual BCK-algebras
A Heyting algebra is a distributive lattice with implication and a dual $BCK$-algebra is an algebraic system having as models logical systems equipped with implication. The aim of this paper is to investigate the relation of Heyting algebras between dual $BCK$-algebras. We define notions of $i$-invariant and $m$-invariant on dual $BCK$-semilattices and prove that a Heyting semilattice is equiva...
متن کاملProfinite Heyting Algebras and Profinite Completions of Heyting Algebras
This paper surveys recent developments in the theory of profinite Heyting algebras (resp. bounded distributive lattices, Boolean algebras) and profinite completions of Heyting algebras (resp. bounded distributive lattices, Boolean algebras). The new contributions include a necessary and sufficient condition for a profinite Heyting algebra (resp. bounded distributive lattice) to be isomorphic to...
متن کاملNormalization by Completeness with Heyting Algebras
Usual normalization by evaluation techniques have a strong relationship with completeness with respect to Kripke structures. But Kripke structures is not the only semantics that ts intuitionistic logic: Heyting algebras are a more algebraic alternative. In this paper, we focus on this less investigated area: how completeness with respect to Heyting algebras generate a normalization algorithm fo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the Section of Logic
سال: 2016
ISSN: 2449-836X,0138-0680
DOI: 10.18778/0138-0680.45.3.4.08